Search results for " image processing and enhancement"
showing 4 items of 4 documents
Puzzle image mosaic
2005
A novel technique for opus vermiculatum mosaic rendering
2006
In this paper we present a method to generate a digital mosaic starting from a raster input image. Mosaics generation of artistic quality is challenging. The basic elements, the tiles, typically small polygons, must be packed tightly, emphasizing orientations chosen by the artist. An adhoc boundaries detection have to be performed according to the directional guidelines. Different mosaic styles can be automatically rendered, depending on artistic techniques considered (“opus musivum”, “opus vermiculatum”, etc.). The proposed method is able to reproduce the colors of the original image emphasizing relevant boundaries by placing tiles along their direction. The boundaries detection is based o…
Artificial mosaics
2005
Art often provides valuable insight that can be applied to technological innovations, especially in the fields of image processing and computer graphics. In this paper we present a method to transform a raster input image into a good-quality mosaic: an “artificial mosaic.” The creation of mosaics of artistic quality is challenging because the tiles that compose a mosaic, typically small polygons, must be packed tightly and yet must follow and emphasize orientations chosen by the artist. The proposed method can reproduce the colors of the original image and emphasize relevant boundaries by placing tiles along edge directions. No user intervention is needed to detect the boundaries: they are …
Fast Photomosaic
2005
Photomosaic is a technique which transforms an input image into a rectangular grid of thumbnail images preserving the overall appearance. The typical photomosaic algorithm searches from a large database of images one picture that approximates a block of pixels in the main image. Since the quality of the output depends on the size of the database, it turns out that the bottleneck in each photomosaic algorithm is the searching process. In this paper we present a technique to speed-up this critical phase using the Antipole Tree Data Structure. This improvement allows the use of larger databases without requiring much longer processing time.